Annals of Pure and Applied Logic
نویسنده
چکیده
We will study the question about decidability for Boolean algebras with first elementary characteristic one. The main problem is sufficient conditions for decidability of Boolean algebras with recursive representation for extended signature by definable predicates. We will use the base definitions on recursive and constructive models from [2, 4-6, 10, 1 l] but on Boolean algebras from [I, 81. @ 1998 Published by Elsevier Science B.V. All rights reserved.
منابع مشابه
On the Provability Logic of Bounded Arithmetic
Berarducci, A. and R. Verbrugge, On the provability logic of bounded arithmetic, Annals of Pure and Applied Logic 61 (1993) 75-93. Let PLQ be the provability logic of IA, + G?,. We prove some containments of the form L c_ PLQc Th(V) where L is the provability logic of PA and V is a suitable class of Kripke frames.
متن کاملWeakly Semirecursive Sets and r.e. Orderings
Kummer, M. and F. Stephan, Weakly semirecursive sets and r.e. orderings, Annals of Pure and Applied Logic 60 (1993) 133-150. Weakly semirecursive sets have been introduced by Jockusch and Owings (1990). In the present paper their investigation is pushed forward by utilizing r.e. partial orderings, which turn out to be instrumental for the study of degrees of subclasses of weakly semirecursive s...
متن کاملThe Logic of Arithmetical Hierarchy
Dzhaparidze, G., The logic of arithmetical hierarchy, Annals of Pure and Applied Logic 66 (1994) 89-112. Formulas of the propositional modal language with the unary modal operators 0, H,, B,, Zz, I!!,, are considered as schemata of sentences of arithmetic (PA), where q A is interpreted as (a formalization of) “A is PA-provable”, X,,A as “A is PA-equivalent to a &-sentence” and &,A as “A is PA-e...
متن کاملCompactness in locales and in formal topology
If a locale is presented by a “flat site”, it is shown how its frame can be presented by generators and relations as a dcpo. A necessary and sufficient condition is derived for compactness of the locale (and also for its openness). Although its derivation uses impredicative constructions, it is also shown predicatively using the inductive generation of formal topologies. A predicative proof of ...
متن کاملSimple generic structures
We study universal-homogenous (generic) structures with predi-mension which have rst order simple theories and examine some con-jectures in this context. We show if for the theory of generic structuresforking independence is the same as d-independence then stable forkingconjecture is true for those theories. References[1] J.Baldwin and N.Shi. Stable generic structures. A...
متن کاملBoundedness Theorems for Dilators and Ptykes
Kechris, A.S., Boundedness theorems for dilators and ptykes, Annals of Pure and Applied Logic 52 (1991) 79-92. The main theorem of this paper is: If f is a partial function from K, to X, which is Pi-bounded, then there is a weakly finite primitive recursive dilator D such that for all infinite a E domu), f(a) s D(a). The proof involves only elementary combinatorial constructions of trees. A gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003